A Knapsack-Like Code Using Recurrence Sequence Representations
نویسندگان
چکیده
We had recently shown that every positive integer can be represented uniquely using a recurrence sequence, when certain restrictions on the digit strings are satisfied. We present the details of how such representations can be used to build a knapsack-like public key cryptosystem. We also present new disguising methods, and provide arguments for the security of the code against known methods of attack.
منابع مشابه
A KNAPSACK-TYPE CRYPTOGRAPHIC SYSTEM USING ALGEBRAIC NUMBER RINGS By NATHAN
The members of the Committee appointed to examine the dissertation of NATHAN THOMAS MOYER find it satisfactory and recommend that it be accepted. Since the advent of the public-key cryptosystem, the search for a secure and efficient scheme has been ongoing. One such system makes use of the classical knapsack problem to implement security. Though very efficient, this system was shown to be insec...
متن کاملGenetic Algorithm solution for Cryptanalysis of Knapsack Cipher with Knapsack Sequence of Size 16
With growth of networked systems and applications such as ecommerce, the demand for internet security is increasing. Information can be secured using cryptography, anti-virus, malwares, spywares, firewall etc. In cryptology, cryptanalysis is a discipline where the ciphers are attacked and broke thus enabling the developers to strengthen the cipher. Nowadays cryptanalysis of ciphers is gaining p...
متن کاملEEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations
GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...
متن کاملDual Population Genetic Algorithm
The 0/1 Knapsack Problem is an optimization problem solved using various soft computing methods. The solution to the 0/1 Knapsack Problem (KP) can be viewed as the result of a sequence of decisions. Simple Genetic Algorithm (SGA) effectively solves knapsack problem for large data set. But it has problems like premature convergence and population diversity. Dual Population Genetic Algorithm (DPG...
متن کاملMultidimensional Knapsack Problem: The Influence of Representation
Fitness landscape analysis techniques are used to better understand the influence of genetic representations and associated variation operators when solving a combinatorial optimization problem. Five representations are investigated for the Multidimensional Knapsack problem. Common mutation operators (like bit-flip mutation) and classic 1-point and uniform crossover are employed to generate fit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1503.04238 شماره
صفحات -
تاریخ انتشار 2015